We explore relations between various variational problems for graphs: among the functionals considered are Euler characteristic χ(G), characteristic length μ(G), mean clustering ν(G), inductive dimension ι(G), edge density (G), scale measure σ(G), Hilbert action η(G) and spectral complexity ξ(G). A new insight in this note is that the local cluster coefficient C(x) in a finite simple graph can ...

the arya and paris model is a commonly accepted method to translate a particle-size distribution curve into a corresponding soil moisture characteristic curve using scaling parameter (α). the scaling parameter, in the original model of arya and paris (1981), was assumed constant (α=1.38) for all soil texture classes. in recent years, several studies have shown that α is not constant and its qua...

achieving optimal production cycle time for improving manufacturing processes is one of the common problems in production planning. during recent years, different approaches have been developed for solving this problem, but most of them assume that mean quality characteristic is constant over production run length and sets it on customer’s target value. however, the process mean may drift from ...